Proceedings of the International Conference on Theory and Application of Mathematics and Informatics ICTAMI 2005 - Alba Iulia , Romania SQUARE - STABLE AND WELL - COVERED GRAPHS

نویسندگان

  • Vadim E. Levit
  • Eugen Mandrescu
چکیده

The stability number of the graph G, denoted by α(G), is the cardinality of a maximum stable set of G. In this paper we characterize the square-stable graphs, i.e., the graphs enjoying the property α(G) = α(G), where G is the graph with the same vertex set as in G, and an edge of G is joining two distinct vertices, whenever the distance between them in G is at most 2. We show that every square-stable graph is well-covered, and wellcovered trees are exactly the square-stable trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

On Konig-Egervary Square-Stable Graphs

The stability number of a graph G, denoted by α(G), is the cardinality of a maximum stable set, and µ(G) is the cardinality of a maximum matching in G. If α(G) + µ(G) equals its order, then G is a König-Egerváry graph. In this paper we deal with square-stable graphs, i.e., the graphs G enjoying the equality α(G) = α(G 2), where G 2 denotes the second power of G. In particular, we show that a Kö...

متن کامل

On α-Square-Stable Graphs

The stability number of a graph G, denoted by α(G), is the cardinality of a maximum stable set, and μ(G) is the cardinality of a maximum matching in G. If α(G) + μ(G) equals its order, then G is a König-Egerváry graph. We call G an α-square-stable graph if α(G) = α(G), where G denotes the second power of G. These graphs were first investigated by Randerath and Wolkmann, [18]. In this paper we o...

متن کامل

A Theoretical Study of H2S and CO2 Interaction with the Single-Walled Nitrogen Doped Carbon Nanotubes

The physical adsorption of hydrogen sulfide and carbon dioxide gases on the zigzag (5,0) carbon nanotubes doped with nitrogen was investigated through the application of B3LYP/6-31G* at the level of theory on Gaussian 03 software. A variety of stable and high abundance structures of nitrogen doped carbon nanotubes were considered in order to study the interaction between the mentioned gases in ...

متن کامل

A Theoretical Study of H2S and CO2 Interaction with the Single-Walled Nitrogen Doped Carbon Nanotubes

The physical adsorption of hydrogen sulfide and carbon dioxide gases on the zigzag (5,0) carbon nanotubes doped with nitrogen was investigated through the application of B3LYP/6-31G* at the level of theory on Gaussian 03 software. A variety of stable and high abundance structures of nitrogen doped carbon nanotubes were considered in order to study the interaction between the mentioned gases in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005